Bounded point evaluations and capacity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L-bounded Point Evaluations for Polynomials and Uniform Rational Approximation

A connection is established between uniform rational approximation and approximation in the mean by polynomials on compact nowhere dense subsets of the complex plane C. Peak points for R(X) and bounded point evaluations for Hp(X, dA), 1 ≤ p < ∞, play a fundamental role.

متن کامل

Excludability and Bounded Computational Capacity

We study the notion of excludability in repeated games with vector payoffs, when one of the players is restricted to strategies with bounded computational capacity. We show that a closed set is excludable by Player 2 when Player 1 is restricted to using only bounded-recall strategies if and only if it does not contain a convex approachable set. We provide partial results when Player 1 is restri...

متن کامل

Admissibility of Parenting Capacity Evaluations

I. ISSUE In the child welfare context, protective agencies, the courts, and attorneys often turn to psychologists to evaluate parenting capacity. This issue brief aids attorneys representing parents in child welfare proceedings by: (1) describing the components and methodology of a typical parenting capacity evaluation; (2) describing the uses and limitations of a parenting capacity evaluation;...

متن کامل

Bounded Capacity Priority Queues

A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. We consider the set of all such related pairs (a, 7) in both the case that cs is a binary sequence and the case that o is a permutation of 1,2,. , n. We derive properties of this relation and use it to d...

متن کامل

Bounded computational capacity equilibrium

A celebrated result of Abreu and Rubinstein (1988) states that in repeated games, when the players are restricted to playing strategies that can be implemented by finite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and individually rational payoffs. In this paper we explore the limitations of this result. We prove tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 1972

ISSN: 0022-1236

DOI: 10.1016/0022-1236(72)90026-2